ZINC: Efficient Indexing for Skyline Computation
نویسندگان
چکیده
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered attribute domains. The key innovation in ZINC is based on combining the strengths of the ZB-tree, which is the state-of-the-art index method for computing skylines involving totally ordered domains, with a novel, nested coding scheme that succinctly maps partial orders into total orders. An extensive performance evaluation demonstrates that ZINC significantly outperforms the state-of-the-art TSS indexing scheme for skyline queries.
منابع مشابه
Mining Thick Skylines over Large Databases
People recently are interested in a new operator, called skyline [3], which returns the objects that are not dominated by any other objects with regard to certain measures in a multi-dimensional space. Recent work on the skyline operator [3, 15, 8, 13, 2] focuses on efficient computation of skylines in large databases. However, such work gives users only thin skylines, i.e., single objects, whi...
متن کاملDistributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks
Skyline queries play an important role in applications such as multicriteria decision making and user preference systems. Recently, more attention has been paid to the problem of efficient skyline computation in the P2P systems. Due to the high distribution of the P2P networks, the skyline computation incurs too many intermediate results transferred between peers, which consumes mass of the net...
متن کاملAn efficient skyline framework for matchmaking applications
In this article, we present a skyline-based matchmaking framework. The current method of carrying out the matchmaking procedure identifies items based on users’ specifications. We rethink matchmaking procedures in such a way that they can find items that can satisfy a specific computing demand from a user and recommend a collection of better candidates among the identified items. This endows a ...
متن کاملEquivalence Heuristics for Malleability-Aware Skylines
In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. Especially, the rise of the Semantic Web and linked open data leads to personalization issues where skyli...
متن کاملProbabilistic Skyline Queries over Uncertain Moving Objects
Data uncertainty inherently exists in a large number of applications due to factors such as limitations of measuring equipments, update delay, and network bandwidth. Recently, modeling and querying uncertain data have attracted considerable attention from the database community. However, how to perform advanced analysis on uncertain data remains an interesting question. In this paper, we focus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PVLDB
دوره 4 شماره
صفحات -
تاریخ انتشار 2010